Query Formulation for Answer Projection
نویسندگان
چکیده
We examine the effects of various query modifications on the problem of answer projection — the task of retrieving documents that support a given answer to a question. We compare different techniques such as phrase searches and term weighting, and show that some models achieve significant improvements over unmodified queries.
منابع مشابه
Linear Constraint Projection
In most of the existing linear CLP systems, a projection is employed for the answer presentation in order to eliminate the dead variables not occuring in the query. But projection is more than an ornament of the answer presentation. We have shown that there are planning problems that depend heavily on an early projection. While it is not clear how to integrate early projection in the presence o...
متن کاملRAPPORT DE RECHERCHE On Querying Simple Conceptual Graphs With Negation
We consider basic conceptual graphs, namely simple conceptual graphs (SGs), which are equivalent to the existential conjunctive positive fragment of first-order logic. The fundamental problem, deduction, is performed by a graph homomorphism, called projection. The existence of a projection from a SG Q to a SG G means that the knowledge represented by Q is deducible from the knowledge represente...
متن کاملOn querying simple conceptual graphs with negation
We consider basic conceptual graphs, namely simple conceptual graphs (SGs), which are equivalent to the existential conjunctive positive fragment of first-order logic. The fundamental problem, deduction, is performed by a graph homomorphism called projection. The existence of a projection from a SG Q to a SG Gmeans that the knowledge represented by Q is deducible from the knowledge represented ...
متن کاملAlgebraic Construction of Projection PCPs
In a projection PCP, also known as Label-Cover, the verifier makes two queries to the proof, and the answer to the first query determines at most one satisfying answer to the second query. Projection PCPs with low error probability are the basis of most NPhardness of approximation results known today. In this essay we outline a construction of a projection PCP with low error and low blow-up. Th...
متن کاملAggressive Morphology and Lexical Relations for Query Expansion
Our submission to TREC this year is based on a combination of systems. The first is the conceptual indexing and retrieval system that was developed at Sun Microsystems Laboratories (Woods et al., 2000a; Woods et al., 2000b). The second is the MultiText system developed at the University of Waterloo (Clarke et al., 2000; Cormack et al., 2000). The conceptual indexing system was designed to help ...
متن کامل